翻訳と辞書 Words near each other ・ Ranger Ross ・ Ranger Russet ・ Ranger School ・ Range Line, Indiana ・ Range minimum query ・ Range mode query ・ Range Murata ・ Range Networks ・ Range of a projectile ・ Range of Light (album) ・ Range of motion ・ Range of Motion (exercise machine) ・ Range of Motion (film) ・ Range of the Awful Hand ・ Range Ponds State Park ・ Range query (data structures) ・ Range query (database) ・ Range rate ・ Range Regional Airport ・ Range Resources ・ Range Riders ・ Range River ・ Range road ・ Range Rover ・ Range Rover (L322) ・ Range Rover (L405) ・ Range Rover (P38A) ・ Range Rover Classic ・ Range Rover Evoque ・ Range Rover Sport Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Range query (data structures) ： ウィキペディア英語版 Range query (data structures) In data structures, a range query consists of preprocessing some input data into a data structure to efficiently answer any number of queries on any subset of the input. Particularly, there is a group of problems that have been extensively studied where the input is an array of unsorted numbers and a query consists in computing some function on a specific range of the array. In this article we describe some of these problems together with their solutions. ==Problem statement== We may state the problem of range queries in the following way: a range query $q\_f(A,i,j)$ on an array $A=()$ of ''n'' elements of some set $S$, denoted $A()$, takes two indices $1\backslash leq\; i\backslash leq\; j\backslash leq\; n$, a function $f$ defined over arrays of elements of $S$ and outputs $f(A())=\; f(a\_i,\backslash ldots,a\_j)$. This should be done space and time efficient. consider for instance $f\; =\; sum$ and $A()$ an array of numbers, the range query $sum(A,i,j)$ computes $sum(A())\; =\; (a\_i+\backslash ldots\; +\; a\_j)$, for any $1\; \backslash leq\; i\; \backslash leq\; j\; \backslash leq\; n$. These queries may be answered in constant time and using $O(n)$ extra space by calculating the sums of the first $i$ elements of $A$ and storing them into an auxiliar array $B$, such that $B()$ contains the sum of the first $i$ elements of $A$ for every $0\backslash leq\; i\backslash leq\; n$.Therefore any query might be answered by doing $sum(A())\; =\; B()\; -\; B()$. This strategy may be extended for every group operator $f$ where the notion of $f^$ is well defined and easily computable. Finally notice this solution might be extended for arrays of dimension two with a similar preprocessing. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Range query (data structures)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.